// 逆序对- binary index tree 树状数组 - discrete data 离散化数据
#include <stdio.h>
int n, a[65538], b[65538], d[65538];
int main(int argc, char const *argv[])
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", a + i);
        d[i] = i;
    }

    return 0;
}
